The CIFF Proof Procedure: Definition and Soundness Results
نویسندگان
چکیده
We introduce a new proof procedure for abductive logic programming and prove two soundness results. Our procedure extends that of Fung and Kowalski by integrating abductive reasoning with constraint solving and by relaxing the restrictions on allowed inputs for which the procedure can operate correctly. An implementation of our proof procedure is available and has been applied successfully in the context of
منابع مشابه
The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Definition, Implementation and a Web Application
Abduction has found broad application as a powerful tool for hypothetical reasoning with incomplete knowledge, which can be handled by labeling some pieces of information as abducibles, i.e. as possible hypotheses that can be assumed to hold, provided that they are consistent with the given knowledge base. Attempts to make the abductive reasoning an effective computational tool gave rise to Abd...
متن کاملThe CIFF Proof Procedure for Abductive Logic Programming with Constraints
We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abductive reasoning with constraint solving and by relaxing the restrictions on allowed inputs for which the procedure can operate correctly. An implementation of our proof procedure is available and has been applied successfully in...
متن کاملThe CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments
We present the CIFF proof procedure for abductive logic programming with constraints, and we prove its correctness. CIFF is an extension of the IFF proof procedure for abductive logic programming, relaxing the original restrictions over variable quantification (allowedness conditions) and incorporating a constraint solver to deal with numerical constraints as in constraint logic programming. Fi...
متن کاملAbductive Logic Programming with CIFF: Implementation and Applications
We describe a system implementing a novel extension of Fung and Kowalski’s IFF abductive proof procedure which we call CIFF, and its application to realise intelligent agents that can construct (partial or complete) plans and react to changes in the environment. CIFF extends the original IFF procedure in two ways: by dealing with constraint predicates and by dealing with non-allowed abductive l...
متن کاملThe CIFF System: an Overview
This paper details the structure and the main algorithms in the CIFF System 4.0, a SICStus Prolog implementation of the CIFF proof procedure. 1 The high-level design of the CIFF System The CIFF System 4.0 requires SICStus Prolog 3.11.2 (or newer versions of SICStus Prolog 3 release) and it starts by compiling, on the Prolog top-level shell, the ciff.pl file which, in turn, compiles all the CIFF...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004